/**
 * @program: LeetCode
 * @description: LeetCode : 62. 不同路径
 * @author: WXY
 * @create: 2023-01-06 09:55
 * @Version 1.0
 **/
public class Num062_uniquePaths {
    public static int uniquePaths(int m, int n) {
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i <= n; i++) {
            dp[1][i] = 1;
        }
        for (int i = 1; i <= m; i++) {
            dp[i][1] = 1;
        }
        for (int i = 2; i <= m; i++) {
            for (int j = 2; j <= n; j++) {
                dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
            }
        }
        return dp[m][n];
    }

    public static void main(String[] args) {
        int i = uniquePaths(3, 3);
        System.out.println(i);
    }
}
